Convergence of a Proximal Point Algorithm for Solving Minimization Problems
نویسندگان
چکیده
We introduce and consider a proximal point algorithm for solving minimization problems using the technique of Güler. This proximal point algorithm is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic distance-like functions. It can be seen as an extragradient iterative scheme. We prove the convergence rate of this new proximal point method under mild assumptions. Furthermore, it is shown that this estimate rate is better than the available ones.
منابع مشابه
A Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملProPPA: A Fast Algorithm for ℓ1 Minimization and Low-Rank Matrix Completion
We propose a Projected Proximal Point Algorithm (ProPPA) for solving a class of optimization problems. The algorithm iteratively computes the proximal point of the last estimated solution projected into an affine space which itself is parallel and approaching to the feasible set. We provide convergence analysis theoretically supporting the general algorithm, and then apply it for solving `1-min...
متن کاملGraph Convergence for H(.,.)-co-Accretive Mapping with over-Relaxed Proximal Point Method for Solving a Generalized Variational Inclusion Problem
In this paper, we use the concept of graph convergence of H(.,.)-co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, Graph convergence for the H(.,.)-co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کاملOn the Convergence and O(1/N) Complexity of a Class of Nonlinear Proximal Point Algorithms for Monotonic Variational Inequalities
This paper presents a class of proximal point algorithms (PPA) with nonlinear proximal terms. Proximal minimization algorithm using Bregman distance for convex minimization is extended for solving monotonic variational inequalities. Under suitable conditions, the convergence and O(1/N) computing complexity/convergence rate of the proposed algorithm is obtained. Further more, connections to some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012